Homomorphisms of planar (m,n)-colored-mixed graphs to planar targets
نویسندگان
چکیده
An (m,n)-colored-mixed graph G=(V,A1,A2,⋯,Am,E1,E2,⋯,En) is a having m colors of arcs and n edges. We do not allow two or edges to have the same endpoints. A homomorphism from an G another H morphism φ:V(G)→V(H) such that each edge (resp. arc) mapped color (and orientation). T said be Pg(m,n)-universal if every in Pg(m,n) (the planar graphs with girth at least g) admits T. show exist for 2m+n≥3 any value find minimal (in number vertices) other cases.
منابع مشابه
Homomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs
In this article, we introduce and study the properties of some target graphs for 2-edge-colored homomorphism. Using these properties, we obtain in particular that the 2-edge-colored chromatic number of the class of triangle-free planar graphs is at most 50. We also show that it is at least 12. C © 2016 Wiley Periodicals, Inc. J. Graph Theory 00: 1–20, 2016
متن کاملColored Homomorphisms of Colored Mixed Graphs
The homomorphisms of oriented or undirected graphs, the oriented chromatic number, the relationship between acyclic coloring number and oriented chromatic number, have been recently studied. Improving and combining earlier techniques of N. Alon and T. H. Marshall (1998, J. Algebraic Combin. 8, 5 13) and A. Raspaud and E. Sopena (1994, Inform. Process. Lett. 51, 171 174) we prove here a general ...
متن کاملHomomorphisms of signed planar graphs
Signed graphs are studied since the middle of the last century. Recently, the notion of homomorphism of signed graphs has been introduced since this notion captures a number of well known conjectures which can be reformulated using the definitions of signed homomorphism. In this paper, we introduce and study the properties of some target graphs for signed homomorphism. Using these properties, w...
متن کاملChromatic number of sparse colored mixed planar graphs
A colored mixed graph has vertices linked by both colored arcs and colored edges. The chromatic number of such a graph G is defined as the smallest order of a colored mixed graph H such that there exists a (arc-color preserving) homomorphism from G to H . We study in this paper the colored mixed chromatic number of planar graphs, partial 2-trees and outerplanar graphs with given girth.
متن کاملHomomorphisms and edge-colourings of planar graphs
We conjecture that every planar graph of odd-girth 2k + 1 admits a homomorphism to Cayley graph C(Z 2 , S2k+1), with S2k+1 being the set of (2k + 1)vectors with exactly two consecutive 1’s in a cyclic order. This is an strengthening of a conjecture of T. Marshall, J. Nešetřil and the author. Our main result is to show that this conjecture is equivalent to the corresponding case of a conjecture ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2021.112600